Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("GLOVER F")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 61

  • Page / 3
Export

Selection :

  • and

PARAMETRIC BRANCH AND BOUND.GLOVER F.1978; OMEGA; GBR; DA. 1978; VOL. 6; NO 2; PP. 145-152; BIBL. 11 REF.Article

REDUCING THE SIZE OF SOME IP FORMULATIONS BY SUBSTITUTION.GLOVER F.1976; OPER. RES. QUART.; G.B.; DA. 1976; VOL. 27; NO 1, PART. 2; PP. 261-263; BIBL. 8 REF.Article

MATHEMATICAL PROGRAMMING MODELS AND METHODS FOR THE JOURNAL SELECTION PROBLEMGLOVER F; KLINGMAN D.LIBRARY (THE) QUARTERLY. 1972, Vol 42, Num 1, pp 43-58Article

NEW RESULTS ON EQUIVALENT INTEGER PROGRAMMING FORMULATIONS.GLOVER F.1975; MATH. PROGRAMMG; NETHERL.; DA. 1975; VOL. 8; NO 1; PP. 84-90; BIBL. 9 REF.Article

COMPACT LP BASES FOR A CLASS OF IP PROBLEMS.GLOVER F.1977; MATH. PROGRAMMG; NETHERL.; DA. 1977; VOL. 12; NO 1; PP. 102-109; BIBL. 9 REF.Article

A NOTE ON COMPUTATIONAL SIMPLIFICATIONS IN SOLVING GENERALIZED TRANSPORTATION PROBLEMS.GLOVER F.1973; TRANSPORT. SCI.; U.S.A.; DA. 1973; VOL. 7; NO 4; PP. 351-361; BIBL. 13 REF.Article

POLYHEDRAL ANNEXATION IN MIXED INTEGER AND COMBINATORIAL PROGRAMMING.GLOVER F.1975; MATH. PROGRAMMG; NETHERL.; DA. 1975; VOL. 9; NO 2; PP. 161-188; BIBL. 1 P.Article

FIRST FACETS OF THE OCTAHEDRON.GLOVER F.1974; DISCRETE MATH.; NETHERL.; DA. 1974; VOL. 9; NO 2; PP. 109-117; BIBL. 6 REF.Article

CONVEXITY CUTS AND CUT SEARCHGLOVER F.1973; OPER. RES.; U.S.A.; DA. 1973; VOL. 21; NO 1; PP. 123-134; BIBL. 16 REF.Serial Issue

Futurepaths for integer programming an links to artificial intelligenceGLOVER, F.Computers & operations research. 1986, Vol 13, Num 5, pp 533-549, issn 0305-0548Article

MATHEMATICAL OPTIMIZATION. A SUCCESSFUL TOOL FOR LOGISTICS PROBLEMSGLOVER F; KLINGMAN D.1981; OPERATIONAL RESEARCH '81. OR891. IFORS 81. INTERNATIONAL CONFERENCE ON OPERATIONAL RESEARCH. 9/1981/HAMBURG; NLD/USA/GBR; AMSTERDAM; NEW YORK; OXFORD: NORTH HOLLAND; DA. 1981; PP. 453-465; ABS. FRE; BIBL. 41 REF.Conference Paper

NETWORK APPLICATION IN INDUSTRY AND GOVERNMENTGLOVER F; KLINGMAN D.1977; A.I.I.E. TRANS.; USA; DA. 1977; VOL. 9; NO 4; PP. 363-376; BIBL. 37 REF.Article

FINDING MINIMUM SPANNING TREES WITH A FIXED NUMBER OF LINKS AT A NODE.GLOVER F; KLINGMAN D.1975; IN: COMB. PROGRAMM. METHODS APPL. PROC. NATO ADV. STUDY INST.; VERSAILLES; 1974; DORDRECHT; D. REIDEL; DA. 1975; PP. 191-201; BIBL. 1 P.Conference Paper

AGGREGATING DIOPHANTINE EQUATIONSGLOVER F; WOOLSEY RED.1972; Z. OPER. RES.; DTSCH.; DA. 1972; VOL. 16; NO 1; PP. 1-10; ABS. ALLEM.; BIBL. 4 REF.Serial Issue

NETWORK RELAXATIONS AND LOWER BOUNDS FOR MULTIPLE CHOICE PROBLEMSGLOVER F; MULVEY JM.1982; INFOR (OTTAWA); ISSN 0315-5986; CAN; DA. 1982; VOL. 20; NO 4; PP. 385-393; ABS. FRE; BIBL. 17 REF.Article

RECENT DEVELOPMENTS IN COMPUTER IMPLEMENTATION TECHNOLOGY FOR NETWORK FLOW ALGORITHMSGLOVER F; KLINGMAN D.1982; INFOR (OTTAWA); ISSN 0315-5986; CAN; DA. 1982; VOL. 20; NO 4; PP. 433-452; ABS. FRE; BIBL. 60 REF.Article

A O(N LOG N) ALGORITHM FOR LP KNAPSACKS WITH GUB CONSTRAINTSGLOVER F; KLINGMAN D.1979; MATH. PROGRAMMG; NLD; DA. 1979; VOL. 17; NO 3; PP. 345-361; BIBL. 17 REF.Article

DYNAMIC STRATEGIES FOR BRANCH AND BOUND.GLOVER F; TANGEDAHL L.1976; OMEGA; G.B.; DA. 1976; VOL. 4; NO 5; PP. 571-576; BIBL. 10 REF.Article

RESORT DEVELOPMENT: A NETWORK-RELATED MODEL FOR OPTIMIZING SITES AND VISITSGLOVER F; ROGOZINSKI J.1982; J. LEIS. RES.; ISSN 0022-2216; USA; DA. 1982; VOL. 14; NO 3; PP. 235-247; BIBL. 17 REF.Article

IMPROVED CONVEXITY CUTS FOR LATTICE POINT PROBLEMS.GLOVER F; KLINGMAN D.1976; J. OPTIMIZ. THEORY APPL.; U.S.A.; DA. 1976; VOL. 19; NO 2; PP. 283-291; BIBL. 5 REF.Article

THE LOWER BOUNDED AND PARTIAL UPPER BOUNDED DISTRIBUTION MODELCHARNES A; GLOVER F; KLINGMAN D et al.1971; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1971; VOL. 18; NO 2; PP. 277-281; BIBL. 3 REF.Serial Issue

THE GENERALIZED ALTERNATING PATH ALGORITHM FOR TRANSPORTATION PROBLEMS.BARR RS; GLOVER F; KLINGMAN D et al.1978; EUROP. J. OPERAT. RES.; NETHERL.; DA. 1978; VOL. 2; NO 2; PP. 137-144; BIBL. 20 REF.Article

Ultrafiltration and reverse osmosis for the dairy industry = L'ultrafiltration et l'osmose inverse en industrie laitièreGLOVER, F. A.1985, 207 p.Book

A STRONGLY CONVERGENT PRIMAL SIMPLEX ALGORITHM FOR GENERALIZED NETWORKSELAM J; GLOVER F; KLINGMAN D et al.1979; MATH. OPER. RES.; USA; DA. 1979; VOL. 4; NO 1; PP. 39-59; BIBL. 24 REF.Article

OPTIMAL WEIGHTED ANCESTRY RELATIONSHIPS.GLOVER F; KLASTORIN T; KLINGMAN D et al.1974; MANAG. SCI.; U.S.A.; DA. 1974; VOL. 20; NO 8; PP. 1190-1193; BIBL. 5 REF.Article

  • Page / 3